Quantum oblivious set-member decision protocol
نویسندگان
چکیده
منابع مشابه
Two Quantum Protocols for Oblivious Set-member Decision Problem
In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privac...
متن کاملA simple quantum oblivious transfer protocol
A simple and efficient protocol for quantum oblivious transfer is proposed. The protocol can easily be implemented with present technology and is secure against cheaters with unlimited computing power provided the receiver does not have the technology to store the particles for an arbitrarily long period of time. The proposed protocol is a significant improvement over the previous protocols. Un...
متن کاملQuantum oblivious transfer protocol based on entangled states
We describe an efficient protocol for quantum oblivious transfer. The protocol, which can be implemented with present technology, is secure against cheaters with unlimited computing power and with the ability to store the particles for an arbitrarily long period of time. The protocol is based on the following two entangled states: | Φ〉 = 1 √ 2 (|↑↑〉+ |↓ x〉) and |Ψ〉 = 1 √ 2 (|↑↑〉+ |↓ −x〉). PACS ...
متن کاملVerifiable quantum oblivious transfer protocol based on entangled states
We describe an efficient protocol for verifiable quantum oblivious transfer. The protocol, which can be implemented with present technology, is secure against cheaters with unlimited computing power and with the ability to store the particles for an arbitrarily long period of time. The protocol is based on the following two entangled states: |Φ〉 = 1 √ 2 (|↑↑〉+ |↓ x〉) and |Ψ〉 = 1 √ 2 (|↑↑〉+ |↓ −...
متن کاملQuantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and efficient protocol based on the exchange of quantum information to check mutual knowledge of a common string in such a way that honest parties will always succeed in convincing each other, while a dishonest party inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2015
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.92.022309